class Solution:
    def integerBreak(self, n):
        """
        :type n: int
        :rtype: int
        """
        f = [0] * (n + 1)
        f[1] = 1
        for i in range(2, n + 1):
            for j in range(1, i):
               f[i] = max(f[i],max(f[i-j] *j ,j*(i-j)))
        print(f)
        return max(f)


s = Solution()
m = s.integerBreak(10)
print(m)